The Fibonacci Unimodal Map
نویسندگان
چکیده
منابع مشابه
The Fibonacci Unimodal Map
The Fibonacci recurrence of the critical orbit appeared in the work of Branner and Hubbard on complex cubic polynomials [BH, §12] and in Yoccoz's work [Yl, Y2] on quadratic ones, as the "worst" pattern of recurrence. On the other hand, a real quadratic Fibonacci map was suggested by Hofbauer and Keller [HK] as a possible candidate for a map having a "wild" attractor (that is, a set A which is t...
متن کامل(Non)invertibility of Fibonacci-like unimodal maps restricted to their critical omega-limit sets
A Fibonacci(-like) unimodal map is defined by special combinatorial properties which guarantee that the critical omega-limit set ω(c) is a minimal Cantor set. In this paper we give conditions to ensure that f |ω(c) is invertible, except at a subset of the backward critical orbit. Furthermore, any finite subtree of the binary tree can appear for some f as the tree connecting all points at which ...
متن کاملHyperbolicity of the Trace Map for the Weakly Coupled Fibonacci Hamiltonian
We consider the trace map associated with the Fibonacci Hamiltonian as a diffeomorphism on the invariant surface associated with a given coupling constant and prove that the non-wandering set of this map is hyperbolic if the coupling is sufficiently small. As a consequence, for these values of the coupling constant, the local and global Hausdorff dimension and the local and global box counting ...
متن کاملUnimodal Loading
This paper deals with optimal learning and provides a uniied viewpoint of most signiicant results in the eld. The focus is on the problem of local minima in the cost function that is likely to aaect more or less any learning algorithm. We give some intriguing links between optimal learning and the computational complexity of loading problems. We exhibit a computational model such that the solut...
متن کاملUnimodal thresholding
Most thresholding algorithms have difficulties processing images with unimodal distributions. In this paper an algorithm, based on finding a corner in the histogram plot, is proposed that is capable of performing bilevel thresholding of such images. Its effectiveness is demonstrated on synthetic data as well as a variety of real data, showing its successful application to edges, corners, differ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Mathematical Society
سال: 1993
ISSN: 0894-0347
DOI: 10.2307/2152804